Convergence analysis of Riemannian trust-region methods
نویسندگان
چکیده
This document is an expanded version of [ABG05], with a detailed convergence analysis. A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subproblems, particular attention is paid to the truncated conjugate-gradient technique. The method is illustrated on problems from numerical linear algebra.
منابع مشابه
Accelerated Line-search and Trust-region Methods
A line-search method, based on retractions, is formulated on Riemannian manifolds. This Riemannian line-search method, as well as a previouslyproposed Riemannian trust-region method, are further generalized to accelerated line-search and trust-region methods, where the next iterate is allowed to be any point that produces at least as much decrease in the cost function as a fixed fraction of the...
متن کاملNonsmooth Trust Region Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
This paper presents a Riemannian trust region algorithm for unconstrained optimization problems with locally Lipschitz objective functions defined on complete Riemannian manifolds. To this end we define a function Φ : TM → R on the tangent bundle TM , and at k-th iteration, using the restricted function Φ|TxkM where TxkM is the tangent space at xk, a local model function Qk that carries both fi...
متن کاملAn Implicit Riemannian Trust-Region Method for the Symmetric Generalized Eigenproblem
The recently proposed Riemannian Trust-Region method can be applied to the problem of computing extreme eigenpairs of a matrix pencil, with strong global convergence and local convergence properties. This paper addresses inherent inefficiencies of an explicit trustregion mechanism. We propose a new algorithm, the Implicit Riemannian Trust-Region method for extreme eigenpair computation, which s...
متن کاملOn Efficiency of Non-Monotone Adaptive Trust Region and Scaled Trust Region Methods in Solving Nonlinear Systems of Equations
In this paper we run two important methods for solving some well-known problems and make a comparison on their performance and efficiency in solving nonlinear systems of equations. One of these methods is a non-monotone adaptive trust region strategy and another one is a scaled trust region approach. Each of methods showed fast convergence in special problems and slow convergence in other o...
متن کاملRiemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent
The Riemannian trust-region algorithm (RTR) is designed to optimize differentiable cost functions on Riemannian manifolds. It proceeds by iteratively optimizing local models of the cost function. When these models are exact up to second order, RTR boasts a quadratic convergence rate to critical points. In practice, building such models requires computing the Riemannian Hessian, which may be cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006